Incremental Timing Budget Management in Programmable Systems

نویسندگان

  • Elaheh Bozorgzadeh
  • Soheil Ghiasi
  • Atsushi Takahashi
  • Majid Sarrafzadeh
چکیده

Delay budget is an excess delay that each component of a design can tolerate under a given timing constraint. Delay budgeting has been widely exploited to improve the design quality. This paper presents the idea of incrementally re-assigning the delay budgets allotted to different components of a design, which leads to avoiding the re-execution of the intensive budget assignment procedure in each iteration of the tools. Given a budgeting solution and a local change, our approach can re-assign the budget values such that the timing constraints are met. More importantly, it only explores the components locally, which preserves its incremental nature. General sufficient conditions have been presented under which, our approach is provably effective. Experimental results on converting non-integral budgeting assignments to integral ones, advocate our technique’s efficiency. The budget assignments have been used to map a number of applications to an FPGA platform. The results have been compared to other existing methods. Our approach exhibits improvement over other similar techniques in terms of total delay budget assigned to design components. This can be exploited to significantly improve other design metrics such as area and tool runtime. Our experimental results have verified that.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Low Power Optimization Using Timing Budget Management

This paper develops the procedures of proving low power optimization using timing budgeting. The procedures include mapping of several designs, which are implemented using parameterized CoreGen IP cores, on Xilinx FPGA devices, modeling maximum timing budget problems with an LP solver, and utilizing Xpower to estimate power consumption. Our experimental results show that an average improvement ...

متن کامل

Budget Management and Its Applications

Given a directed acyclic graph with timing constraints, the budget management problem is to assign to each vertex an incremental delay such that the total sum of these delays is maximized without violating given constraints. We propose the notion of slack sensitivity and budget gradient to demonstrate characteristics of budget management. We develop an optimal polynomial-time algorithm for the ...

متن کامل

A rule-based evaluation of ladder logic diagram and timed petri nets for programmable logic controllers

This paper describes an evaluation through a case study by measuring a rule-based approach, which proposed for ladder logic diagrams and Petri nets. In the beginning, programmable logic controllers were widely designed by ladder logic diagrams. When complexity and functionality of manufacturing systems increases, developing their software is becoming more difficult. Thus, Petri nets as a high l...

متن کامل

The INPROTK 2012 Release: A Toolkit for Incremental Spoken Dialogue Processing

We describe the 2012 release of INPROTK, our “Incremental Processing Toolkit” which combines a powerful and extensible architecture for incremental processing with components for incremental speech recognition and, new to this release, incremental speech synthesis. These components work domainindependently; we also provide example implementations of higher-level components such as natural langu...

متن کامل

Economic order quantity model for growing items with incremental quantity discounts

Certain inventory items are living organisms, for example livestock, and are therefore capable of growing during the replenishment cycle. These items often serve as various saleable food items downstream in supply chains. The purpose of this paper is to develop a lot sizing model for growing items if the supplier of the items offers incremental quantity discounts. A mathematical model is derive...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004